Models of computation - PDFSEARCH.IO - Document Search Engine

Models of computation
Results: 1716

#	Item
841	Post-publication version of “Aaron Sloman develops a distinctive view of – Virtual Machinery and Evolution of Mind (Part 1)” pages[removed]In Alan Turing - His Work and Impact, eds S. B. Cooper & J. van Leeuwen, Els Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2013-09-07 19:32:51 Turing machine Models of computation Computability theory Alan Turing Virtual machine Turing completeness VM Computability Programming language Theoretical computer science Computer science Theory of computation
842	Draft invited presentation at: Pierre Duhem Conference (Society for Philosophy of Science), Tuesday 19th July 2011, Nancy, France, http://www.sps-philoscience.org/activites/activite.php?id=15 Evolution of mind as a feat Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-07-15 22:05:05 Models of computation Virtual machines Programming language implementation Turing machine VM Simulation Communications protocol Alan Turing Programming language System software Computing Software
843	Presse und Öffentlichkeitsarbeit, Add to Reading List Source URL: www.mpq.mpg.de Language: English - Date: 2015-01-07 10:13:28 Quantum phases Hall effect Models of computation Quantum Hall effect Quantum optics Chern class Quantum computer State of matter Electron Physics Condensed matter physics Spintronics
844	A Stochastic l-Calculus Dana S. Scott University Professor, Emeritus, Carnegie Mellon University Visiting Scholar, UC Berkeley As a formal theory, the l-Calculus has equational rules for the explicit definition of functi Add to Reading List Source URL: www.pfeifer-research.de Language: English - Date: 2013-05-20 07:44:50 Computability theory Models of computation Logic in computer science Lambda calculus Function Combinatory logic Denotational semantics Type theory John Myhill Mathematics Theoretical computer science Mathematical logic
845	Journal of Object Technology Published by AITO — Association Internationale pour les Technologies Objets http://www.jot.fm/ On using pre and postconditions to tackle the aspect scheduling problem Add to Reading List Source URL: www.jot.fm Language: English - Date: 2014-12-29 10:27:36 Aspect-oriented software development Diagrams Models of computation Infographics Unified Modeling Language State diagram UML state machine Stereotype Class diagram Software development UML diagrams Software
846	Capability-based Financial Instruments 1 Mark S. Miller , Chip Morningstar2, Bill Frantz2 1 Add to Reading List Source URL: www.erights.org Language: English - Date: 2004-05-18 05:27:32 Data types Cryptographic protocols Inter-process communication Models of computation Smalltalk Lambda calculus Variable Alice and Bob Secure multi-party computation Computing Software engineering Computer programming
847	Inferring Synchronization under Limited Observability Martin Vechev, Eran Yahav, and Greta Yorsh IBM T.J. Watson Research Center Abstract. This paper addresses the problem of automatically inferring synchronization for c Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:23:50 Automata theory Transition Observability Models of computation
848	On Voting Machine Design for Verification and Testability Cynthia Sturton Susmit Jha Sanjit A. Seshia Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:40 Electronic voting Information society Voting machine Finite-state machine Voting system Theoretical computer science Design for testing X-Machine Testing Stream X-Machine Models of computation Politics Design
849	CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa Add to Reading List Source URL: levine.sscnet.ucla.edu Language: English - Date: 2006-03-16 11:03:47 Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science Computability theory Mathematics
850	Formal Verification of SystemC Designs Using a Petri-Net Based Representation Daniel Karlsson, Petru Eles, Zebo Peng Department of Computer and Information Science, Linköpings universitet, Sweden {danka, petel, zebpe}@i Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2006-03-23 11:50:34 SystemC Models of computation Transaction-level modeling E Thread Petri net Electronic engineering Hardware verification languages Hardware description languages

UPDATE